DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems

Duplication Based Scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target system. In this paper, we classify DBS algorithms into two categories according to the task duplication method used. We then present our new DBS algorithm that extracts the strong features of the two categories of DBS algorithms. Our simulation study shows that the proposed algorithm achieves considerable performance improvement over existing DBS algorithms with equal or less time complexity. We analytically obtain the boundary condition for the worst case behavior of the proposed algorithm and also prove that the algorithm generates an optimal schedule for a tree structured input directed acyclic graph .